RBT-GA: a novel metaheuristic for solving the multiple sequence alignment problem
نویسندگان
چکیده
منابع مشابه
RBT-L: A location based approach for solving the Multiple Sequence Alignment problem
This paper presents a novel approach to solve the Multiple Sequence Alignment (MSA) problem. The Rubber Band Technique: Location Base (RBT-L) introduced in this paper, is inspired by the elastic behaviour of a Rubber Band (RB) on a plate with poles. RBT-L is an iterative optimisation algorithm designed and implemented to find the optimal alignment for a set of input protein sequences. RBT-L is ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMultiple Sequence Alignment using GA and NN
Multiple sequence alignment (MSA) is an important tool in biological analysis. However, it is difficult to solve this class of problems, due to their exponential complexity. This paper presents an algorithm combining the genetic algorithm and a self-organizing neural network for solution to MSA. This approach demonstrates improved performance in long DNA and RNA data sets exhibiting small simil...
متن کاملM2Align: parallel multiple sequence alignment with a multi-objective metaheuristic
Motivation Multiple sequence alignment (MSA) is an NP-complete optimization problem found in computational biology, where the time complexity of finding an optimal alignment raises exponentially along with the number of sequences and their lengths. Additionally, to assess the quality of a MSA, a number of objectives can be taken into account, such as maximizing the sum-of-pairs, maximizing the ...
متن کاملA* Algorithms for the Constrained Multiple Sequence Alignment Problem
It is well known that A algorithm reduces the search space in many applications. For shortest path computations, the algorithm uses a heuristic estimator which can better guide the search to the destination. It allocates memory dynamically to store only the necessary vertices, which are those vertices in its open list and close list. Therefore, an A algorithm for the shortest paths search probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Genomics
سال: 2009
ISSN: 1471-2164
DOI: 10.1186/1471-2164-10-s1-s10